New and Simple Algorithms for Stable Flow Problems
نویسندگان
چکیده
منابع مشابه
Improved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کاملA New Approach Generating Robust and Stable Schedules in m-Machine Flow Shop Scheduling Problems: A Case Study
This paper considers a scheduling problem with uncertain processing times and machine breakdowns in industriall/office workplaces and solves it via a novel robust optimization method. In the traditional robust optimization, the solution robustness is maintained only for a specific set of scenarios, which may worsen the situation for new scenarios. Thus, a two-stage predictive algorithm is prop...
متن کاملNew Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP)
Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution. The Generalized Traveling Salesman Problem (GTSP)expands the TSP to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to fi...
متن کاملApproximation Algorithms for Stable Marriage Problems
Approximation Algorithms for Stable Marriage Problems Hiroki Yanagisawa Kyoto University, Japan 2007 The stable marriage problem is a classical matching problem introduced by Gale and Shapley. An instance of the stable marriage problem consists of men and women, where each person totally orders all members of the opposite sex. A matching is stable if there is no pair that prefer each other to t...
متن کاملSimple Algorithms for Graph Partition Problems
Based on the Belief Propagation Method, we propose simple and deterministic algorithms for some NP-hard graph partitioning problems, such as the Most Likely Partition problem and the Graph Bisection problem. These algorithms run in O(n+m) or O((n+m) log n) time on graphs with n vertices and m edges. For their average case analysis, we consider the planted solution model and prove that they yiel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2019
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-018-00544-7